/ leetcodesolve / 88. Merge Sorted Array.py
swadhinbiswas solve more problem · 5/11/2025
8bcf412
13 lines · 311 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13


class Solution:
    def merge(self,nums1: List[int], m: int, nums2: List[int], n: int) ->None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        j=0
        for i in range(m,len(nums1)):
          nums1[i]=nums2[j]
          j+=1;i+=1
        nums1.sort()